%0 Conference Proceedings
%4 dpi.inpe.br/banon/1999/01.14.18.06
%2 sid.inpe.br/banon/2001/03.30.15.54.04
%T Marching cubes multiresolucao
%D 1998
%A Andrade, Sandro Santos,
%A Buck, Thomas de Araujo,
%E Costa, L. da F,
%E Camara, G.,
%B International Symposium on Computer Graphics, Image Processing and Vision, 11 (SIBGRAPI)
%C Rio de Janeiro, RJ, Brazil
%8 20-23 Oct. 1998
%I Sociedade Brasileira de Computação
%J Porto Alegre
%S Proceedings
%1 SBC - Sociedade Brasileira de Computação
%K iso-surfaces, polygonal approximation, multiresolution sampling, iso-superficies, aproximacao poligonal, amostragem multiresolucao
%X A widespread approach to generating polygonal approximations of iso-surfaces in volume data is the Marching Cubes algorithm. This algorithm, however, has the disadvantage that the quantity of polygons generated is considerable. The Multiresolution Marching Cubes presented here reduces this quantity by a variable size marching cube. The resulting polygonal chain offers a wide spectrum for representing the desired surface.
%3 ssp046.pdf
%O The conference was held in Rio de Janeiro, RJ, Brazil, from October 20 to 23.